Minkowski and KZ reduction of nearly orthogonal lattice bases

نویسندگان

  • Sanjeeb Dash
  • Ramesh Neelamani
  • Gregory B. Sorkin
چکیده

We prove that if a lattice basis is nearly orthogonal (the angle between any basis vector and the linear subspace spanned by the other basis vectors is at least π3 radians), then a KZ-reduced basis can be obtained from it in polynomial time. We also show that if a nearly orthogonal lattice basis has nearly equal vector lengths (within a certain constant factor of one another), then the basis is Minkowski reduced. We use these results to show thatm i.i.d. random vectors drawn from a uniform distribution over the unit ball in R form a Minkowski-reduced basis of the lattice generated by the vectors asymptotically almost surely as n tends to infinity, if m ≤ cn for any constant c < 1/4, and form a KZ-reduced basis for c < 1/5. The result on Minkowski reduction in lattices generated by random vectors extends a result of Donaldson (1979) who proved this property for fixedm as n tends to infinity.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Nearly Orthogonal Lattice Bases and Random Lattices

We study lattice bases where the angle between any basis vector and the linear subspace spanned by the other basis vectors is at least π 3 radians; we denote such bases as “nearly orthogonal.” We show that a nearly orthogonal lattice basis always contains a shortest lattice vector. Moreover, we prove that if the basis vector lengths are “nearly equal,” then the basis is the unique nearly orthog...

متن کامل

Practical HKZ and Minkowski Lattice Reduction Algorithms

Recently, lattice reduction has been widely used for signal detection in multiinput multioutput (MIMO) communications. In this paper, we present three novel lattice reduction algorithms. First, using a unimodular transformation, a significant improvement on an existing Hermite-Korkine-Zolotareff-reduction algorithm is proposed. Then, we present two practical algorithms for constructing Minkowsk...

متن کامل

Adaptive Switched Lattice Reduction-Aided Linear Detection Techniques for MIMO Systems

Lattice reduction (LR) aided multiple-inputmultiple-out (MIMO) linear detection can achieve the maximum receive diversity of the maximum likelihood detection (MLD). By emloying the most commonly used Lenstra, Lenstra, and L. Lov ́asz (LLL) algorithm, an equivalent channel matrix which is shorter and nearly orthogonal is obtained. And thus the noise enhancement is greatly reduced by employing the...

متن کامل

On Nearly Orthogonal Lattice Bases

We study ”nearly orthogonal” lattice bases, or bases where the angle between any basis vector and the linear subspace spanned by the other basis vectors is greater than π 3 radians. We show that a nearly orthogonal lattice basis always contains a shortest lattice vector. Moreover, if the lengths of the basis vectors are “nearly equal”, then the basis is the unique nearly orthogonal lattice basi...

متن کامل

Practical algorithms for constructing HKZ and Minkowski reduced bases

In this paper, three practical lattice basis reduction algorithms are presented. The first algorithm constructs a Hermite, Korkine and Zolotareff (HKZ) reduced lattice basis, in which a unimodular transformation is used for basis expansion. Our complexity analysis shows that our algorithm is significantly more efficient than the existing HKZ reduction algorithms. The second algorithm computes a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011